Anonymizing Data with Relational and Transaction Attributes

نویسندگان

  • Giorgos Poulis
  • Grigorios Loukides
  • Aris Gkoulalas-Divanis
  • Spiros Skiadopoulos
چکیده

Publishing datasets about individuals that contain both relational and transaction (i.e., set-valued) attributes is essential to support many applications, ranging from healthcare to marketing. However, preserving the privacy and utility of these datasets is challenging, as it requires (i) guarding against attackers, whose knowledge spans both attribute types, and (ii) minimizing the overall information loss. Existing anonymization techniques are not applicable to such datasets, and the problem cannot be tackled based on popular, multi-objective optimization strategies. This work proposes the first approach to address this problem. Based on this approach, we develop two frameworks to offer privacy, with bounded information loss in one attribute type and minimal information loss in the other. To realize each framework, we propose privacy algorithms that effectively preserve data utility, as verified by extensive experiments.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

SECRETA: A System for Evaluating and Comparing RElational and Transaction Anonymization algorithms

Publishing data about individuals, in a privacy-preserving way, has led to a large body of research. Meanwhile, algorithms for anonymizing datasets, with relational or transaction attributes, that preserve data truthfulness, have attracted significant interest from organizations. However, selecting the most appropriate algorithm is still far from trivial, and tools that assist data publishers i...

متن کامل

Anonymizing Transaction Data by Integrating Suppression and Generalization

Privacy protection in publishing transaction data is an important problem. A key feature of transaction data is the extreme sparsity, which renders any single technique ineffective in anonymizing such data. Among recent works, some incur high information loss, some result in data hard to interpret, and some suffer from performance drawbacks. This paper proposes to integrate generalization and s...

متن کامل

An Algebra for the BiTemporal Nested Data Model

A generalized bitemporal relational data model (BTNM) is formalized for the representation of bitemporal data with nested structure of arbitrary depth. Time is represented by temporal elements. Time-varying attributes are timestamped by taking advantage of the nested feature of the model. Thus, the temporal dimension of the model is expressed by bitemporal nested attributes consisting of atomic...

متن کامل

0004 - 9 SEMANTICS OF TIME - VARYING INFORMATIONChristian

| This paper provides a systematic and comprehensive study of the underlying semantics of temporal databases, summarizing the results of an intensive collaboration between the two authors over the last ve years. We rst examine how facts may be associated with time, most prominently with one or more dimensions of valid time and transaction time. One common case is that of a bitemporal relation, ...

متن کامل

Contract Design Choices and the Balance of Ex Ante and Ex Post Transaction Costs in Software Development Outsourcing

This paper examines multiple contract design choices in the context of transaction and relational attributes and consequent ex ante and ex post transaction costs. It focuses on two understudied themes in the IT outsourcing literature. First, while the literature is predominantly concerned with opportunism and consequent ex post hazard costs that contracts can safeguard against, parties to a con...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2013